Open shop scheduling problem to minimize makespan with release dates
نویسندگان
چکیده
منابع مشابه
Single machine batch scheduling problem with family setup times and release dates to minimize makespan
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O n n m + 1 m time dynamic programming algorithm and an O(mk k P 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of di...
متن کاملScheduling and Location (ScheLoc): Makespan Problem with Variable Release Dates
While in classical scheduling theory the locations of machines are assumed to be fixed we will show how to tackle location and scheduling problems simultaneously. Obviously, this integrated approach enhances the modeling power of scheduling for various real-life problems. In this paper, we present in an exemplary way theory and a solution algorithm for a specific type of a scheduling and a rath...
متن کاملThe unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
In this paper, we consider the unbounded parallel batch machine scheduling with release dates and rejection. A job is either rejected with a certain penalty having to be paid, or accepted and processed in batches on the parallel batch machine. The processing time of a batch is defined as the longest processing time of the jobs contained in it. The objective is to minimize the sum of the makespa...
متن کاملScheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
In this paper we deal with the problem of assigning a set of n jobs, with release dates and tails, to either one of two unrelated parallel machines and scheduling each machine so that the makespan is minimized. This problem will be denoted by R2jri; qijCmax. The model generalizes the problem on one machine 1jri; qijCmax, for which a very ecient algorithm exists. In this paper we describe a Bra...
متن کاملSingle machine scheduling with release dates and job delivery to minimize the makespan
In single machine scheduling with release dates and job delivery, jobs are processed on a single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jobs. The vehicle can deliver at most c jobs at a shipment. The delivery completion time of a job is defined as the time at which the delivery batch containing the job is delivered...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2013
ISSN: 0307-904X
DOI: 10.1016/j.apm.2012.04.037